Notes on View Synchronization using Default Logic ( Extended Abstract )
نویسندگان
چکیده
The synchronization of views is one of the schema evolution problems and it calls for the rede nition of those views becoming undened after a schema change, in order to keep them still working on the new schema. This problem is particularly di cult for capacity reducing schema changes, when it could be only possible to approximate the existing views. Recently, the use of schema mappings to express schema changes has allowed both to deal with a wide range of schema change operations and to facilitate the view synchronization; but approximating views requires mappings able to describe approximate schema changes. This paper introduces the default schema mappings, a new kind of mappings based on default logic and it provides a preliminary study showing the possibility of using them to realize an approximate view synchronization process.
منابع مشابه
On Terminological Default Reasoning about Spatial Information: Extended Abstract
We extend the theory about terminological default reasoning using a logical base language that can be used to represent spatioterminological phenomena. Based on the description logic ALCRP(S2) the paper discusses how to implement an algorithm for computing extensions of a world description consisting of ALCRP(S2) assertions and a set of closed ALCRP(S2) Reiter-style default rules.
متن کاملA Semantic View on Reasoning about Priorities (extended Abstract)
This paper gives a logical analysis in semantic terms of reasoning about preference relations. A method is proposed for extending logics for reasoning with prioritised information with means to express information about priorities as premises, and for deening the logical consequences of such premises. The method is rst presented in general terms and then applied to two existing systems, priorit...
متن کاملGraph Theoretical Structures in Logic Programs and Default Theories
In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs can be expressed in terms of notions emerging from graph theory, establishing in this way a link between the fields. Namely the stable models, the partial stable models, and the well-founded semantics correspond respectively to the kernels, semik...
متن کاملOn the Extension of Logic Programming withNegation through Uniform
In the past, logic program semantics have been studied often separately from the underlying proof system, and this, consequently, leads to a somewhat confusing status of semantics. In this paper we show that elegant, yet natural semantics can be obtained by building a mechanism of justifying default assumptions on top of a proof system. In particular, we propose extended logic programming langu...
متن کاملDomain Theory Meets Default
1 Abstract. We present a development of the theory of default information structures, combining ideas from domain theory with ideas from non-monotonic logic. Conceptually, our treatment is distinguished from standard default logic in that we view default structures as generating models rather than theories. Reiter's default rules are viewed as non-deterministic algorithms for generating preferr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012